Shapley-Shubik methods in cost sharing problems with technological cooperation
نویسندگان
چکیده
In the discrete cost sharing model with technological cooperation (Bahel and Trudeau (IJGT, 2013)), we study the implications of a number of properties that strengthen the well-known Dummy axiom. Our main axiom, which requires that costless units of demands do not affect the cost shares, is used to characterize two classes of rules. Combined with anonymity and a specific stability property, this requirement picks up sharing methods that allow the full compensation of at most one technological contribution. If instead we strengthen the well-known Dummy property to include agents whose technological contribution is offset by the cost of their demand, we are left with an adaptation of the Shapley-Shubik method that treats technologies as private and rewards their contributions. Our results provide two interesting axiomatizations for the adaptations of the Shapley-Shubik rule to our framework.
منابع مشابه
Paths and Consistency in Additive Cost Sharing Eric
Using a new representation theorem for additive cost sharing methods as sums of path methods, we show that many of the standard additive cost sharing methods (Aumann-Shapley, Shapley Shubik, and Serial Cost) are consistent. These results follow directly from a simple su cient condition for consistency: being generated by associative paths, which can be used to show consistency for many other me...
متن کاملPaths and consistency in additive cost sharing
Using a new representation theorem for additive cost sharing methods as sums of path methods, we show that many of the standard additive cost sharing methods (Aumann-Shapley, Shapley Shubik, and Serial Cost) are consistent. These results follow directly from a simple suucient condition for consistency: being generated by associative paths, which can be used to show consistency for many other me...
متن کاملOptimization Based Characterizations of Cost Sharing Methods
We provide several new characterizations of well known cost sharing methods (CSMs) as maxima of linear (or convex) functionals. For the Shapley-Shubik method the characterization has an interpretation in terms of randomly ordered agents choosing their most preferred CSM, while the characterizations of the Aumann-Shapley and Serial methods have a very general character: any symmetric convex func...
متن کاملAxiomatic Cost and Surplus-Sharing
The equitable division of a joint cost (or a jointly produced output) among agents with different shares or types of output (or input) commodities, is a central theme of the theory of cooperative games with transferable utility. Ever since Shapley’s seminal contribution in 1953, this question has generated some of the deepest axiomatic results of modern microeconomic theory. More recently, the ...
متن کاملOn demand responsiveness in additive cost sharing
We propose two new axioms of demand responsiveness for additive cost sharing with variable demands. Group Monotonicity requires that if a group of agents increase their demands, not all of them pay less. Solidarity says that if agent i demands more, j should not pay more if k pays less. Both axioms are compatible in the partial responsibility theory postulating Strong Ranking, i.e., the ranking...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Social Choice and Welfare
دوره 43 شماره
صفحات -
تاریخ انتشار 2014